Evaluation Algorithm for a Decomposed Simplicial Piecewise- Linear Formulation

نویسندگان

  • V. M. Jiménez-Fernández
  • O. Agamennoni
چکیده

In this work an algorithm for the evaluation of N-dimensional piecewise-linear (PWL) functions is presented. The type of PWL representation which is considered is the denominated simplicial representation that is defined in a N-dimensional domain partitioned by hyperplanes and divided into simplices. The algorithm performs a local function computation into the specific simplex where the evaluation point is found. The simplicial PWL (S-PWL) interpolating equations are collected into a matrix system which adopts the form of the decomposed PWL models. The algorithm works directly with this decomposed model and determines the value of the S-PWL function simply by its values on the vertices. de la función LAT-S simplemente mediante su valor en los vértices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of a finite element method for pressure/potential formulation of elastoacoustic spectral problems

A finite element method to approximate the vibration modes of a structure enclosing an acoustic fluid is analyzed. The fluid is described by using simultaneously pressure and displacement potential variables, whereas displacement variables are used for the solid. A mathematical analysis of the continuous spectral problem is given. The problem is discretized on a simplicial mesh by using piecewi...

متن کامل

Simplicial Dijkstra and A* Algorithms: From Graphs to Continuous Spaces

This paper considers the optimal feedback planning problem of a point robot among polygonal obstacles in R. In this problem the Euclidean distance traveled by the robot is minimized. The approximate optimal feedback plan is computed using a piecewise linear approximation of the costto-go function. The approximate cost-to-go function, in turn, satisfies the discrete version of dynamic programmin...

متن کامل

Piecewise Linear Topology, Evolutionary Algorithms, and Optimization Problems

Schemata theory, Markov chains, and statistical mechanics have been used to explain how evolutionary algorithms (EAs) work. Incremental success has been achieved with all of these methods, but each has been stymied by limitations related to its less-thanglobal view. We show that moving the question into topological space helps in the understanding of why EAs work. Purpose. In this paper we use ...

متن کامل

Simplicial diffeomorphisms

In this paper we will present a theory for simplicial diffeomorphims, that is, diffeomorphims that preserve the incidence relations of a simplicial complex. Simplicial diffeomorphisms can be regarded as curvilinear barycentric coordinates. Using the combination of piecewise linear functions on complexes with simplicial diffeomorphisms, we also propose a new representation of curves and surfaces...

متن کامل

An Iterative-decomposed Piecewise-linear Representation

In this paper a new model description for the representation of one-dimensional piecewise-linear (PWL) characteristics is presented. The description can be efficiently applied to model both, uni-valued and multivalued PWL characteristics, and it has the advantage of obtaining the model parameters directly from the graphic coordinates. The description is denoted as an Iterative and Decomposed (I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015